RANCANG BANGUN APLIKASI PENCARIAN RUTE TERPENDEK TAMBAL BAN MENGGUNAKAN ALGORITMA DIJKSTRA
نویسندگان
چکیده
منابع مشابه
Sistem Informasi Pengarsipan Menggunakan Algoritma Levensthein String pada Kecamatan Seberang Ulu II
Archival information systems in government agency is one of the most used applications for daily acitivities. One feature in application management information document is searching. This feature serves to search for documents from a collection of available information based on keywords entered by the user. But some researches on a search engine (searching) concluded that the average user error...
متن کاملAplikasi belajar membaca iqro' berbasis mobile
Abstrak Kemajuan Ilmu Pengetahuan dan Teknologi (IPTEK) hendaklah diikuti dengan Iman dan Takwa (IMTAK), sangat disayangkan, jika masih banyak masyarakat yang belum bisa membaca huruf hijaiyah yang merupakan dasar dari Al-Qur’an. Masyarakat sekarang telah disibukkan dengan berbagai aktipitas sehingga mereka sulit untuk belajar dengan Ustad atau Ustadza mengenai huruf hijaiyah. Untuk mengatasi m...
متن کاملDirect Power Control of a Dfig-based Wind Turbine under Unbalanced Grid Voltage without Rotor Position Sensor
In this paper, the behavior of a doubly fed induction generator (DFIG) is proposed under an unbalanced grid voltage and without using a rotor position sensor. There are two main methods that have been used for the detection of rotor position: use of a shaft sensor and use of a sensorless algorithm. In this paper the shaft sensor is eliminated and a position sensorless algorithm is used for esti...
متن کاملDijkstra Graphs
We revisit a concept that has been central in some early stages of computer science, that of structured programming: a set of rules that an algorithm must follow in order to acquire a structure that is desirable in many aspects. While much has been written about structured programming, an important issue has been left unanswered: given an arbitrary, compiled program, describe an algorithm to de...
متن کاملFormalizing Dijkstra
We present a HOL formalization of the foundational parts of Dijkstra’s classic monograph “A Discipline of Programming”. While embedding programming language semantics in theorem provers is hardly new, this particular undertaking raises several interesting questions, and perhaps makes an interesting supplement to the monograph. Moreover, the failure of HOL’s first order proof tactic to prove one...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Ilmiah Realtech
سال: 2020
ISSN: 2621-590X,1907-0837
DOI: 10.52159/realtech.v16i2.135